| 翻訳と辞書 |
| Normalization property (lambda-calculus) ： ウィキペディア英語版 |
Normalization property (abstract rewriting)
In mathematical logic and theoretical computer science, a rewrite system has the strong normalization property or is terminating (in short: the normalization or the termination) if every term is ''strongly normalizing''; that is, if every sequence of rewrites eventually terminates to an ''irreducible'' term also called a normal form. A rewrite system may also have the weak normalization property, meaning that for every term, there exists at least one particular sequence of rewrites that eventually yields a normal form, i.e., an irreducible term.
== Lambda calculus ==
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Normalization property (abstract rewriting)」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|